Mean-field theory for clustering coefficients in Barabási-Albert networks.
نویسندگان
چکیده
We applied a mean-field approach to study clustering coefficients in Barabási-Albert (BA) networks. We found that the local clustering in BA networks depends on the node degree. Analytic results have been compared to extensive numerical simulations finding a very good agreement for nodes with low degrees. Clustering coefficient of a whole network calculated from our approach perfectly fits numerical data.
منابع مشابه
Higher order clustering coefficients in Barabási-Albert networks
Higher order clustering coefficients C(x) are introduced for random networks. The coefficients express probabilities that the shortest distance between any two nearest neighbours of a certain vertex i equals x, when one neglects all paths crossing the node i. Using C(x) we found that in the Barabási-Albert (BA) model the average shortest path length in a node’s neighbourhood is smaller than the...
متن کاملUniversal scaling of distances in complex networks.
Universal scaling of distances between vertices of Erdos-Rényi random graphs, scale-free Barabási-Albert models, science collaboration networks, biological networks, Internet Autonomous Systems and public transport networks are observed. A mean distance between two nodes of degrees k(i) and k(j) equals to (l(ij)) = A - B log(k(i)k(j)). The scaling is valid over several decades. A simple theory ...
متن کاملMean field analysis of algorithms for scale-free networks in molecular biology
The sampling of scale-free networks in Molecular Biology is usually achieved by growing networks from a seed using recursive algorithms with elementary moves which include the addition and deletion of nodes and bonds. These algorithms include the Barabási-Albert algorithm. Later algorithms, such as the Duplication-Divergence algorithm, the Solé algorithm and the iSite algorithm, were inspired b...
متن کاملRare regions of the susceptible-infected-susceptible model on Barabási-Albert networks.
I extend a previous work to susceptible-infected-susceptible (SIS) models on weighted Barabási-Albert scale-free networks. Numerical evidence is provided that phases with slow, power-law dynamics emerge as the consequence of quenched disorder and tree topologies studied previously with the contact process. I compare simulation results with spectral analysis of the networks and show that the que...
متن کاملConstruction of Scale-Free Networks with Adjustable Clustering
A complex network is characterized by its degree distribution and clustering coefficient. Given a scale-free network, we propose a node-reconnection algorithm that can alter the clustering coefficient of the network while keeping the degree of each node unchanged. Results are shown when the algorithm is applied to reconnect the nodes of scale-free networks constructed using the Barabási-Albert ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 68 4 Pt 2 شماره
صفحات -
تاریخ انتشار 2003